package com.leetcode;

import org.junit.Test;

import java.util.HashMap;
import java.util.Map;

/**
 * Created by Z-hong on 2022/9/16.
 */

public class LeetCode349 {
    @Test
    public int[] intersection(int[] nums1, int[] nums2) { 
    int len=0;
    len= Math.min(nums1.length, nums2.length);
    int[] arr=new int[len];
        for (int i = 0; i < len; i++) {

        }
    return arr;
    }
}
